Showing papers by "Telcordia Technologies published in 2000"

Ozone in indoor environments: concentration and chemistry.

Abstract: The concentration of indoor ozone depends on a number of factors, including the outdoor ozone concentration, air exchange rates, indoor emission rates, surface removal rates, and reactions between ozone and other chemicals in the air. Outdoor ozone concentrations often display strong diurnal variations, and this adds a dynamic excitation to the transport and chemical mechanisms at play. Hence, indoor ozone concentrations can vary significantly from hour-to-hour, day-to-day, and season-to-season, as well as from room-to-room and structure-to- structure. Under normal conditions, the half-life of ozone indoors is between 7 and 10 min and is determined primarily by surface removal and air exchange. Although reactions between ozone and most other indoor pollutants are thermodynamically favorable, in the majority of cases they are quite slow. Rate constants for reactions of ozone with the more commonly identified indoor pollutants are summarized in this article. They show that only a small fraction of the reactions occur at a rate fast enough to compete with air exchange, assuming typical indoor ozone concentrations. In the case of organic compounds, the “fast” reactions involve compounds with unsaturated carbon-carbon bonds. Although such compounds typically comprise less than 10% of indoor pollutants, their reactions with ozone have the potential to be quite significant as sources of indoor free radicals and multifunctional (−C=O, −COOH, −OH) stable compounds that are often quite odorous. The stable compounds are present as both gas phase and condensed phase species, with the latter contributing to the overall concentration of indoor submicron particles. Indeed, ozone/alkene reactions provide a link between outdoor ozone, outdoor particles and indoor particles. Indoor ozone and the products derived from reactions initiated by indoor ozone are potentially damaging to both human health and materials; more detailed explication of these impacts is an area of active investigation.

Just-in-time signaling for WDM optical burst switching networks

Abstract: We describe the architecture, design, and implementation of a novel just-in-time (JIT) signaling protocol for optical burst switching (OBS) in wavelength division multiplexed (WDM) optical networks. The JIT-OBS paradigm is designed for ultra-low-latency unidirectional transport of data-bursts across an optical network. It combines the desirable features of circuit-switching and packet-switching. It features out-of-band control signal processing that eliminates buffering of data-burst at intermediate nodes, while minimizing the setup time, and maximizing the cross-connect bandwidth efficiency. We motivate and describe the architecture of JIT signaling, and analyze its basic performance. We present the detailed signaling message design and discuss the rationale and considerations that went into this design. We describe and examine various scenarios that illustrate the operations of the JIT signaling protocol (JIT-SP) in connection establishment and teardown. Finally, we describe and summarize the JIT signaling software prototype in the Washington, DC Testbed network implemented under the MONET project.

Local presence state and user-controlled presence and message forwarding in unified instant messaging

Abstract: An instant messaging communication system wherein users can obtain instant messaging at different terminal devices, in accordance with information they priorly store in a user defined terminal selection store in a unified instant messaging processor. The unified instant messaging processor also stores user preference data. Data from users arrives at the unified instant messaging processor directly over the internet, while an instant messaging client communicates with the unified instant messaging processor through a presence and messaging processor. The data may include either message data or presence data, and a processor in the unified instant message processor determines the handling of the data, with reference to information prior stored by a user, and enables appropriate formatting and routing of the information.

Constrained multicast routing in WDM networks with sparse light splitting

Abstract: As wavelength division multiplexing (WDM) technology matures and multicast applications become increasingly popular, supporting multicast at the WDM layer becomes an important and yet challenging topic. In this paper, we study constrained multicast routing in WDM networks with sparse light splitting, i.e., where some switches are incapable of splitting light (of copying data in the optical domain) due to evolutional and/or economical reasons. Specifically, we propose four WDM multicast routing algorithms, namely, re-route-to-source, re-route-to-any, member-first, and member-only. Given the network topology, multicast membership information, and light splitting capability of the switches, these algorithms construct a source-based multicast "light-forest" (consisting one or more multicast trees) for each multicast session. While the first two algorithms can build on a multicast tree constructed by IP (which does not take into consideration the splitting capability of the WDM switches), the last two algorithms attempt to address the joint problem of optimal multicast routing and sparse splitting in WDM networks. The performance of these algorithms are compared in terms of the average number of wavelengths used per forest (or multicast session), average number of branches involved (bandwidth) per forest as well as average number of hops encountered (delay) from a multicast source to a multicast member. The results obtained from this research should present new and exciting opportunities for further theoretical as well as experimental work.

Method and system for host mobility management protocol

Abstract: The present invention is directed to a mobility management protocol for supporting real-time and non-real-time multimedia applications on mobile stations of third generation internet protocol (3G-IP) networks. The present invention utilizes as well as extends the session initiation protocol (SIP) to provide for domain hand-off (i.e., roaming) and subnet hand-off (i.e., macro-mobility) so that users can access the network from any location using their own mobile station as they roam across different 3G-IP networks. The present invention supports mobile transmission control protocol (TCP) applications without modifying TCP. More specifically, disclosed herein is: a novel use of the SIP INVITE method for IP address binding; a novel use of the SIP INFO method to provide a means of profile verification and IP address binding; a novel use of the SIP REGISTER method to allow a SIP registrar to obtain a new IP address from a Dynamic Host Configuration Protocol (DHCP) server on behalf of the mobile; and an inventive entity called a SIP_EYE Agent that maintains a record of ongoing TCP connections and releases within the mobile.

Exact analytical solution for current flow through diode with series resistance

Abstract: A simple analytical expression is presented for the current flow in a diode driven by a voltage source through a series resistance. The proposed solution is based on the Lambert W-function. The new expression leads to an efficient method for extracting series resistance from measured current-voltage data. Experimental results are presented which validate the proposed solution and extraction method.

TeleMIP: telecommunications-enhanced mobile IP architecture for fast intradomain mobility

Abstract: This article first surveys existing protocols for supporting IP mobility and then proposes an extension to the mobile IP architecture, called TeleMIP. Our architecture attempts to achieve smaller handoff latency by localizing the scope of most location update messages within an administrative domain or a geographical region. TeleMIP is intended for use in evolving third-generation wireless networks, and introduces a new logical entity, called the mobility agent, which provides a mobile node with a stable point of attachment in a foreign network. While the MA is functionally similar to conventional foreign agents, it is located at a higher level in the network hierarchy than the subnet-specific FAs. Location updates for intradomain mobility are localized only up to the MA; transmission of global location updates are necessary only when the mobile changes administrative domains and/or geographical regions. By permitting the use of private or locally scoped addresses for handling intradomain mobility, TeleMIP allows efficient use of public address space. Also, by reducing the frequency of global update messages, our architecture overcomes several drawbacks of existing protocols, such as large latencies in location updates, higher likelihood of loss of binding update messages, and loss of inflight packets, and thus provides better mobility support for real-time services and applications. The dynamic creation of mobility agents (in TeleMLP) permits the use of load balancing schemes for the efficient management of network resources.

Rechargeable hybrid battery/surpercapacitor system

Abstract: A rechargeable hybrid battery/supercapacitor electrical storage system capable of providing high energy and high power densities comprises an intercalation electrode (17) and a capacitor electrode (13) combined with a separator (15) and electrically-conductive current collector elements (11, 19) to form a unitary cell structure (10). An electrolyte solution of a dissociable salt absorbed into the porous structure of the separator (15) provides complementary ion species which respectively reversibly intercalate into the one electrode (17) and capacitively adsorb at the surface of the other electrode (13) upon the application of charging current. The high density stored electrical energy may be recovered at high power over extended periods upon demand of a utilizing device and may be rapidly restored to stable capacity through numerous charging cycles.

Single database private information retrieval implies oblivious transfer

Abstract: A Single-Database Private Information Retrieval (PIR) is a protocol that allows a user to privately retrieve from a database an entry with as small as possible communication complexity. We call a PIR protocol non-trivial if its total communication is strictly less than the size of the database. Non-trivial PIR is an important cryptographic primitive with many applications. Thus, understanding which assumptions are necessary for implementing such a primitive is an important task, although (so far) not a well-understood one. In this paper we show that any non-trivial PIR implies Oblivious Transfer, a far better understood primitive. Our result not only significantly clarifies our understanding of any non-trivial PIR protocol, but also yields the following consequences: - Any non-trivial PIR is complete for all two-party and multiparty secure computations. - There exists a communication-efficient reduction from any PIR protocol to a 1-out-of-n Oblivious Transfer protocol (also called SPIR). - There is strong evidence that the assumption of the existence of a one-way function is necessary but not sufficient for any non-trivial PIR protocol.

The influence of ventilation on reactions among indoor pollutants: modeling and experimental observations.

Abstract: This study examines the influence of ventilation on chemical reactions among indoor pollutants. We have used a one compartment mass balance model to simulate unimolecular and bimolecular reactions occurring indoors. The initial modeling assumes steady-state conditions. However, at low air exchange rates, there may be insufficient time to achieve steady-state. Hence we have also modeled non steady-state scenarios. In the cases examined, the results demonstrate that the concentrations of products generated from reactions among indoor pollutants increase as the ventilation rate decreases. This is true for unimolecular and bimolecuar reactions, regardless of whether the pollutants have indoor or outdoor sources. It is also true even when one of the pollutants has an outdoor concentration that displays large diurnal variations. We have supplemented the modeling studies with a series of experiments conducted in typical commercial offices. The reaction examined was that between ozone and limonene. The ozone was present as a consequence of outdoor-to-indoor transport while the limonene originated indoors. Results were obtained for low and high ventilation rates. Consistent with the modeling studies, the concentrations of monitored products were much larger at the lower ventilation rates (even though the ozone concentrations were lower). The potential for reactions among indoor pollutants to generate reactive and irritating products is an additional reason to maintain adequate ventilation in indoor environments. NOTE

A pattern recognition system for handoff algorithms

Abstract: In wireless cellular systems, handoff algorithms decide when and to which base station to handoff. Traditional handoff algorithms generally cannot keep both the average number of unnecessary handoffs and the handoff decision delay low. They do not exploit the relative constancy of path loss and shadow fading effects at any given location around a base station. This information can in fact be used to improve the efficiency of handoff algorithms, as we do in our new handoff algorithms using statistical pattern recognition. Handoff algorithms with both a negligible number of unnecessary handoffs and a negligible decision delay can therefore be realized.

Separation and Reduction

Abstract: We present some new theorems that equate an iteration to a sequential composition of stronger iterations, and use these theorems to simplify and generalize a number of known techniques for pretending atomicity in concurrent programs.

Design and implementation of ultra-low latency optical label switching for packet-switched WDM networks

Abstract: An ultra-low latency, high throughput Internet protocol (IP) over wavelength division multiplexing (WDM) packet switching technology for next-generation Internet (NGI) applications has been designed and demonstrated. This method overcomes limitations of conventional optical packet switching, which require buffering of packets and synchronization of bits, and optical burst switching methods that require estimation of delays at each node and for each path. An optical label switching technique was developed to realize flexible bandwidth-on-demand packet transport on a reconfigurable WDM network. The aim was to design a network with simplified protocol stacks, scalability, and data transparency. This network will enable the NGI users to send their data applications at gigabit/second access speed with low and predictable latency (<1 /spl mu/sec per switch node), with a system capacity of beyond multi-Tb/s. Packet forwarding utilizes WDM optical headers that are carried in-band on the same wavelength and modulated out-of-band in the frequency domain.

System and circuitry for measuring echoes on subscriber loops

Abstract: A system for performing broadband differential time domain measurement on a subscriber loop. The system comprises a waveform generator coupled to a sampling head. The sampling head includes positive and negative pulse generators each coupled to one of the lines of the subscriber loop. The subscriber lines are in turn also coupled to two inputs of a differential amplifier, whose output is connected to an oscilloscope or other detector.

Delay reduction techniques for playout buffering

Abstract: Receiver synchronization of continuous media streams is required to deal with delay differences and variations resulting from delivery over packet networks such as the Internet. This function is commonly provided using per-stream playout buffers which introduce additional delay in order to produce a playout schedule which meets the synchronization requirements. Packets which arrive after their scheduled playout time are considered late and are discarded. In this paper, we present the Concord algorithm, which provides a delay-sensitive solution for playout buffering. It records historical information and uses it to make short-term predictions about network delay with the aim of not reacting too quickly to short-lived delay variations. This allows an application-controlled tradeoff of packet lateness against buffering delay, suitable for applications which demand low delay but can tolerate or conceal a small amount of late packets. We present a selection of results from an extensive evaluation of Concord using Internet traffic traces. We explore the use of aging techniques to improve the effectiveness of the historical information and hence, the delay predictions. The results show that Concord can produce significant reductions in buffering delay and delay variations at the expense of packet lateness values of less than 1%.

One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval

Abstract: We show that general one-way trapdoor permutations are sufficient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n. More specifically, we present a protocol in which the user sends O(K2) bits and the server sends n - cn/K bits (for any constant c), where K is the security parameter of the trapdoor permutations. Thus, for sufficiently large databases (e.g., when K = nƐ for some small Ɛ) our construction breaks the information-theoretic lower-bound (of at least n bits). This demonstrates the feasibility of basing single-server private information retrieval on general complexity assumptions. An important implication of our result is that we can implement a 1-out-of- n Oblivious Transfer protocol with communication complexity strictly less than n based on any one-way trapdoor permutation.

Applications of Cdma in Wireless/ Personal Communications

Abstract: 1. Introduction to Code-Division Multiple Access Technology. Introduction. Trends in Wireless Communications. Market Trends for Wireless Communications. Needs of Digital Technologies for Wireless Communications. Elements of a Wireless Network. Digital Technologies. Spread Spectrum Technology. Summary. References. 2. Spread Spectrum Systems. Introduction. Types of Techniques Used for Spread Spectrum (SS). The Concept of the Spread Spectrum System. The Performance of Direct Sequence Spread Spectrum. The Direct Sequence Spread Spectrum System. Coherent Binary Phase-Shift Keying. Quadrature Phase-Shift Keying. The Performance of a Code-Division Multiple Access System. Pseudorandom Noise Sequences. Properties of a Maximal Length Pseudorandom Sequence. Autocorrelation. Cross-correlation. Orthogonal Functions. TIA IS-95 CDMA System. Downlink. Uplink (Reverse). Summary. References. 3. CDMA Standards. Introduction. Background. Layering Concepts. Call Processing. Mobile Station Initialization State. Mobile Station Idle State. System Access State. Mobile Station Control on the Traffic Channel State. Base Station Call States. Service Configuration and Negotiation. Concept of System Identification and Network Identification. Registration. Wideband CDMA Standards. Summary. References. 4. System Architecture for Wireless Communications. Introduction. TR-45/TR-46 Reference Model. Elements of the Reference Model. Standardization of the MSC-BS Interface. Supported Architectural Configurations. Call Processing and Supplementary Services. Radio Resource Management. Mobility Management. Transmission Facilities Management. Services. Basic Services. Supplementary Services. Summary. References. 5. Physical Layer of CDMA. Introduction. Open Systems Interconnect Reference Model. Forward CDMA Channel and W-CDMA Channel. Pilot Channel. Sync Channel. Forward Paging Channel. Forward Traffic Channel. Modulator. The Reverse CDMA Channel. Reverse Access Channel. Reverse Traffic Channel. Reverse Channel Modulator. Channel Spacing and Frequency Tolerance. Power Control in CDMA. Modulation Parameters. Convolutional Encoding. Bit Repetition. Block Interleaving. Randomizing. Orthogonal Codes. 64-ary Orthogonal Modulation. Long Codes. Direct PN Spreading. Baseband Filtering. Synchronization of CDMA Signals. Summary. References. 6. Network and Data Link Layers of CDMA. Introduction. Forward CDMA Channel. Sync Channel. Paging Channel. Traffic Channel. Reverse CDMA Channel. Access Channel. Traffic Channel. Forward W-CDMA Channel. Layer-to-Layer Communications. Sync Channel. Paging Channel. Traffic Channel. Reverse W-CDMA Channel. Layer-to-Layer Communications. Access Channel. Traffic Channel. Summary. References. 7. Signaling Applications in the CDMA System. Introduction. End-to-End Operation of a Wireless System. Basic Services. Unique Challenge. Supplementary Services. Handoffs. Summary. References. 8. Voice Applications in the CDMA System. Introduction. Voice Encoding. Pulse Code Modulation. Adaptive Differential Pulse Code Modulation. Code-Excited Linear Predictor. Summary. References. 9. RF Engineering and Facilities Engineering. Introduction. Radio Design for a Cellular/PCS Network. Radio Link Design. Coverage Planning. Propagation Models. Modeling for the Outside Environment. Models for Indoor Environment. Link Budgets. Forward Direction. Reverse Direction. Dual-Mode CDMA Mobiles. The Transition from an Analog System to a Digital System. Overlay Design. Integrated Design. Partial CDMA Coverage, Integrated System. Facilities Engineering. Capacity of Forward Radio Channel. Design Considerations at the Boundary of a CDMA System. Summary. References. 10. Wireless Data. Introduction. Wireless Data Systems. Wide Area Wireless Data Systems. High-Speed Wireless Local Area Networks. WLAN Standards. IEEE 802.11. Wireless Information Networks Forum. High-Performance Radio Local Area Network. ARPA. Access Methods. Fixed-Assignment Access Methods. Random Access Methods. Error Control Schemes. The Data Services Standard for CMDA Cellular/Personal Communications Systems. Asynchronous Data and Group-3 Facsimile. Short Message Service. Packet Data Services for CDMA Cellular/Personal Communications Systems. Summary. References. 11. Management of CDMA Networks. Introduction. Management Goals for PCS Networks. Requirements for Management of PCNs. Telecommunication Management Network and Wireless Network Management. Functional Architecture. Physical Architecture. Quality of Service. Accounting Management. Billing Data Management. Data Message Handling and TMN. Security Management. Information-Gathering Mechanisms. Audit Trail Mechanism. Security Alarm Reporting Mechanisms. Configuration Management. Fault Management. Performance Management. Requirements on Types of Data. Measurement Administration Requirements. Requirement on Measurement Definition. Measurement Job Requirements. Performance Measurement Areas. Summary. References. 12. Interconnection Between Systems. Introduction. Interworking Issues. Dual-Mode Digital/AMPS Systems and Phones. Dual-Mode Digital Systems. Wireless Intelligent Networks. Summary. References. 13. Evolution of CDMA Technology for Wireless Communications. Introduction. Over-the-Air Service Provisioning. Improvement of Speech Coders. Interference Cancellation. Multiple Beam Adaptive Antenna Array. Improvements of Handoff Algorithms. Summary. References. A. Traffic Tables. B. List of Abbreviations and Acronyms. Index.

Telcordia Technologies: the journey to high maturity

Abstract: How does a large, multifaceted company change its culture from one where quality and customer satifaction were an afterthought to one where these elements became the driving force behind its main software development business, achieving both ISO 9001 registration and a CMM Level 5 rating in the process? Telcordia Technologies (software development groups) instituted these institution-wide changes over five years.

Design and analysis of low-power access protocols for wireless and mobile ATM networks

Abstract: This paper describes the design and analysis of a lowdpower medium access control lMACr protocol for wireless/mobile ATM networks. The protocol – denoted ECdMAC lenergy conserving medium access controlr – is designed to support different traffic types with qualitydofdservice lQoSr provisions. The network is based on the infrastructure model where a base station lBSr serves all the mobiles currently in its cell. A reservationdbased approach is proposed, with appropriate scheduling of the requests from the mobiles. This strategy is utilized to accomplish the dual goals of reduced energy consumption and quality of service provision over wireless links. A priority round robin with dynamic reservation update and error compensation scheduling algorithm is used to schedule the transmission requests of the mobiles. Discretedevent simulation has been used to study the performance of the protocol. A comparison of energy consumption of the ECdMAC to a number of other protocols is provided. This comparison indicates the ECdMAC has, in general, better energy consumption characteristics. Performance analysis of the proposed protocol with respect to different qualitydofdservice parameters using video, audio and data traffic models is provided.

Pcs-to-mobile ip internet working

Abstract: A method and system for providing seamless mobile IP connectivity between mobile stations (MS) connected to a PCS network via base stations (HS) connected to base station switching centers (BSCs). The BSCs are connected to a mobile station switching station (MSC) and are configured to direct voice traffic from the MS to the MSC. A gateway muter (GR) is connected between the BSCs and the Internet and each BSC is configured as an IP data node. One or more subsets are defined, each of which includes at least one BSC. Each MS is assigned a permanent IP address and associated with a home subset. When the system detects that the MS is connected to a BSC outside of its home subset, it is assigned a care-of address to the MS to which IP data can be forwarded. IP data from the MS is muted though the GR. IP data directed to the MS is directed to the MS's permanent IP address. If the MS is connected to a BSC outside of its home subset, the data tragic is forwarded to the MS's care-of address. A mobile station and base station controller for use in such a network is also presented.

Competitive queue policies for differentiated services

Abstract: We consider the setting of a network providing differentiated services. As is often the case in differentiated services, we assume the packets are tagged as either being high- or low-priority packets. Outgoing links in the network are serviced by a single FIFO queue. Our model gives a benefit of /spl alpha//spl ges/1 to each high-priority packet and a benefit of 1 to each low-priority packet. A queue policy controls which of the arriving packets are dropped and which enter the queue. Once a packet enters the queue it is eventually sent. The aim of a queue policy is to maximize the sum of the benefits of all the packets it delivers. We analyze and compare different queue policies for this problem using the competitive analysis approach, where the benefit of the online policy is compared to the benefit of an optimal offline policy. We derive both upper and lower bounds for the policies we consider, and in most cases our bounds are tight. We believe that competitive analysis gives important insight into the performance of these simple queuing policies.

Active link layer and intra-domain mobility for IP networks

Abstract: Active packets are utilized by a mobile terminal (801) in a wireless network to manage the micro-mobility which includes both link layer mobility and intra-domain mobility of a wireless connection as the mobile terminal moves from one cell to another in a domain of a network. Active packets convey instructions and data so nodes in the domain may update forwarding tables maintained by each of the devices in the domain. The forwarding table entries contain both link layer entries and network layer entries to efficiently handle roaming by the mobile terminal.

Self-configuring networks

Abstract: To make future tactical battlefield networks more flexible and robust, nodes must rapidly configure themselves with little or no human intervention and reconfigure automatically as the environment changes. This paper describes the dynamic registration and configuration protocol (DRCP) and dynamic address allocation protocol (DAAP) that together can provide true stateless autoconfiguration of an entire network domain. We first describe DRCP which extends DHCP into new domains such as wireless networks and commercial service providers. We then describe DAAP, which distributes addresses and other configuration parameters to DRCP servers. Although kept much simpler by relying on DRCP we show DAAP must still be carefully designed to ensure robustness while maintaining enough address hierarchy to reduce routing protocol overhead. Implementations of DRCP and DAAP on a Linux PC platform are described.

TAPS: a first-order verifier for cryptographic protocols

Abstract: We describe a proof method for cryptographic protocols, based on a strong secrecy invariant that catalogues conditions under which messages can be published. For typical protocols, a suitable first-order invariant can be generated automatically from the program text, independent of the properties being verified, allowing safety properties to be proved by ordinary first-order reasoning. We have implemented the method in an automatic verifier, TAPS, that proves safety properties roughly equivalent to those in published Isabelle verifications, but does so much faster (usually within a few seconds) and with little or no guidance from the user. We have used TAPS to analyze about 60 protocols, including all but three protocols from the Clark and Jacob survey; on average, these verifications each require less than 4 seconds of CPU time and less than 4 bytes of hints from the user.

Analysis of optimal thread pool size

Abstract: The success of e-commerce, messaging middleware, and other Internet-based applications depends in part on the ability of network servers to respond in a timely and reliable manner to simultaneous service requests. Multithreaded systems, due to their efficient use of system resources and the popularity of shared-memory multi-processor architectures, have become the server implementation of choice. However, creating and destroying a thread is far from free, requiring run-time memory allocation and deallocation. These overheads become especially onerous during periods of high load and can be a major factor behind system slowdowns. A thread-pool architecture addresses this problem by prespawning and then managing a pool of threads. Threads in the pool are reused, so that thread creation and destruction overheads are incurred only once per thread, and not once per request. However, efficient thread management for a given system load highly depends on the thread pool size, which is currently determined heuristically. In this paper, we characterize several system resource costs associated with thread pool size. If the thread pool is too large, and threads go unused, then processing and memory resources are wasted maintaining the thread pool. If the thread pool is too small, then additional threads must be created and destroyed on the fly to handle new requests. We analytically determine the optimal thread pool size to maximize the expected gain of using a thread.

Xor-trees for efficient anonymous multicast and reception

Abstract: We examine the problem of efficient anonymous multicast and reception in general communication networks. We present algorithms that achieve anonymous communication, are protected against traffic analysis, and require O(1) amortized communication complexity on each link and low computational comlexity. The algorithms support sender anonymity, receiver(s) anonymity, or sender-receiver anonymity.

System and method for energy-efficient transmission power control, routing and transmission scheduling in wireless communication networks

Abstract: A mobile system capable of proactively predicting characteristics for optimal communication among mobile nodes comprises a network controller and adaptive predictive mobile nodes. The adaptive predictive mobile nodes contain a position location technology element, a database containing information on factors affecting radio propagation, and a prediction processor. To provide energy efficient power control and routing for a communication, the adaptive predictive mobile node determines its current and predicted future position and the current and future predicted positions of other nodes in the network. Based on the information obtained, the adaptive predictive node executes a set of prediction capabilities in the prediction processor. After executing these capabilities, the adaptive predictive node identifies the advantaged location, power level, transmission parameters, communication time and route for communications between nodes. The adaptive predictive mobile node can then communicate when the criteria are met or may request scheduling for the communication based on the criteria. To request scheduling, the adaptive predictive node communicates the identified criteria to the network control entity. The network control entity determines whether the request can be supported. If the network can support the request, the communication is scheduled. If the network cannot support the request, the adaptive predictive node has the option of recalculating the criteria for communication and requesting scheduling based on the alternative criteria.