Showing papers by "Telcordia Technologies published in 2012"

An energy-aware distributed clustering protocol in wireless sensor networks using fuzzy logic

Abstract: Clustering is an effective approach for organizing a network into a connected hierarchy, load balancing, and prolonging the network lifetime. On the other hand, fuzzy logic is capable of wisely blending different parameters. This paper proposes an energy-aware distributed dynamic clustering protocol (ECPF) which applies three techniques: (1) non-probabilistic cluster head (CH) elections, (2) fuzzy logic, and (3) on demand clustering. The remaining energy of the nodes is the primary parameter for electing tentative CHs via a non-probabilistic fashion. A non-probabilistic CH election is implemented by introducing a delay inversely proportional to the residual energy of each node. Therefore, tentative CHs are selected based on their remaining energy. In addition, fuzzy logic is employed to evaluate the fitness (cost) of a node in order to choose a final CH from the set of neighboring tentative CHs. On the other hand, every regular (non CH) node elects to connect to the CH with the least fuzzy cost in its neighborhood. Besides, in ECPF, CH elections are performed sporadically (in contrast to performing it every round). Simulation results demonstrate that our approach performs better than well known protocols (LEACH, HEED, and CHEF) in terms of extending network lifetime and saving energy.

Data Communications Principles

Abstract: Introduction to Data Communications. Theoretical Foundations of Digital Communications. Error Correcting and Detecting Codes. Baseband Pulse Transmission. Passband Data Transmission. Synchronization. Optimum Data Transmission. Automatic and Adaptive Equalization. Echo Cancellation. Topics in Digital Communications. Index.

Method, apparatus and program for detecting spoofed network traffic

Abstract: A method, an apparatus and a program for detecting spoofed internet Protocol (IP) traffic directed to a network having a plurality of autonomous systems (AS) is provided. The method comprises receiving an incoming packet through an AS, the incoming packet containing a source IP address and a destination IP address, acquiring a corresponding source and destination IP address prefixes, converting the corresponding source and destination IP address prefixes into a source AS number and a destination AS number, determining if the incoming packet arrived from an unexpected source based upon the corresponding destination IP address prefix and the converted source and destination AS number using an unexpected pair tuple table generated from network routing information and generating an alert indicating that the incoming packet is not allowed to enter the network.

Architectures and Protocols for Capacity Efficient, Highly Dynamic and Highly Resilient Core Networks [Invited]

Abstract: The Core Optical Networks (CORONET) program addresses the development of architectures, protocols, and network control and management to support the future advanced requirements of both commercial and government networks, with a focus on highly dynamic and highly resilient multi-terabit core networks. CORONET encompasses a global network supporting a combination of IP and wavelength services. Satisfying the aggressive requirements of the program required a comprehensive approach addressing connection setup, restoration, quality of service, network design, and nodal architecture. This paper addresses the major innovations developed in Phase 1 of the program by the team led by Telcordia and AT&T. The ultimate goal is to transfer the technology to commercial and government networks for deployment in the next few years.

Per-flow traffic measurement through randomized counter sharing

Abstract: Traffic measurement provides critical real-world data for service providers and network administrators to perform capacity planning, accounting and billing, anomaly detection, and service provision. One of the greatest challenges in designing an online measurement module is to minimize the per-packet processing time in order to keep up with the line speed of the modern routers. To meet this challenge, we should minimize the number of memory accesses per packet and implement the measurement module in the on-die SRAM. The small size of SRAM requires extremely compact data structures to be designed for storing per-flow information. The best existing work, called counter braids, requires more than 4 bits per flow and performs six or more memory accesses per packet. In this paper, we design a fast and compact measurement function that estimates the sizes of all flows. It achieves the optimal processing speed: two memory accesses per packet. In addition, it provides reasonable measurement accuracy in a tight space where the counter braids no longer work. Our design is based on a new data encoding/decoding scheme, called randomized counter sharing. This scheme allows us to mix per-flow information together in storage for compactness and, at the decoding time, separate the information of each flow through statistical removal of the error introduced during information mixing from other flows. The effectiveness of our online per-flow measurement approach is analyzed and confirmed through extensive experiments based on real network traffic traces. We also propose several methods to increase the estimation range of flow sizes.

System and method for nonlinear optical devices

Abstract: Systems for enhancing the sensitivity of detecting an optical signal using nonlinear optics and method of performing the same. In one embodiment, a single-photon detection system includes an optical amplifier realized in a waveguide, and a photodetector coupled to an output of the optical amplifier. A light detection and ranging system includes the optical amplifier coupled to an optical source and one photodetector. In another embodiment, a photodetection system includes a plurality of optical frequency converters, coupled to an optical source, that sequentially convert a wavelength of photons of the optical source to a final wavelength, and a single-photon photodetector coupled to the optical frequency converters to detect single photons produced by the optical source. In another embodiment, an optical sensor includes an optical pump, and a transducer including an optical ring cavity coupled to the optical pump and configured to utilize optical four-wave mixing to detect an external stimulus.

System, method, control device and program for vehicle collision avoidance using cellular communication

Abstract: Avoiding vehicle collisions using an in-vehicle device is provided. The method comprises receiving a connection request from an in-vehicle device within a moving vehicle when the moving vehicle is within a selected distance from a traffic intersection, establishing connection with the in-vehicle device within a moving vehicle via a serving base station, receiving position information from the in-vehicle device within a moving vehicle corresponding to a position of the moving vehicle, receiving control information for a traffic light at the traffic intersection from a traffic management center and relaying the control information for the traffic light to the in-vehicle device within a moving vehicle. A warning is issued based upon a vehicle speed, a location and a position relative to a traffic intersection. A warning is also issued based upon multiple vehicles speed, relative locations to each other and each position relative to a traffic intersection.

System and method for group communications in 3gpp machine-to-machine networks

Abstract: An inventive system and method for group communication among devices in M2M networks comprises associating one or more of the devices with a gateway having a unique identifier, initiating registration of the devices at an M2M network using the unique identifier of the gateway, providing from the network a temporary identifier to the gateway and associating, in the network, the temporary identifier with the gateway, attaching the devices to the network using the temporary identifier, and communicating information between the network and the device through the gateway. In one aspect, the devices can be classified into sub-groups and each sub-group has a sub-group head that can be attached to the gateway so that the devices can communicate with the network through the sub-group head instead of the gateway. Each sub-group can be associated with a unique temporary identifier, in addition to the temporary identifier associated with the gateway.

System, Method and Program for Customized Voice Communication

Abstract: A method for customized voice communication comprising receiving a speech signal, retrieving a user account including an user profile corresponding to an identifier of a caller producing the speech signal, and determining if the user profile includes a speech profile with at least one dialect. If the user profile includes a speech profile, the method further comprises analyzing using a speech analyzer on the speech signal to classify the speech signal into a classified dialect, comparing the classified dialect with each of the dialects in the user profiles to select one of the dialects, and using the selected dialect for subsequent voice communication with the user. The selected dialect can be used for subsequent recognition and response speech synthesis. Moreover, a method is described for storing a user's own pronunciation of names and addresses, whereby a user may be greeted by the communication device using their own specific pronunciation.

Utility-based bandwidth adaptation in mission-oriented wireless sensor networks

Abstract: This article develops a utility-based optimization framework for resource sharing by multiple competing missions in a mission-oriented wireless sensor network (WSN) environment. Prior work on network utility maximization (NUM) based optimization has focused on unicast flows with sender-based utilities in either wireline or wireless networks. In this work, we develop a generalized NUM model to consider three key new features observed in mission-centric WSN environments: i) the definition of the utility of an individual mission (receiver) as a joint function of data from multiple sensor sources; ii) the consumption of each sender's (sensor) data by multiple missions; and iii) the multicast-tree-based dissemination of each sensor's data flow, using link-layer broadcasts to exploit the “wireless broadcast advantage” in data forwarding. We show how a price-based, distributed protocol (WSN-NUM) can ensure optimal and proportionally fair rate allocation across multiple missions, without requiring any coordination among missions or sensors. We also discuss techniques to improve the speed of convergence of the protocol, which is essential in an environment as dynamic as the WSN. Further, we analyze the impact of various network and protocol parameters on the bandwidth utilization of the network, using a discrete-event simulation of a stationary wireless network. Finally, we corroborate our simulation-based performance results of the WSN-NUM protocol with an implementation of an 802.11b network.

Switched link-based vehicular network architecture and method

Abstract: A multiple hop communications method is among a plurality of moving vehicles. Each moving vehicles has a plurality of unidirectional radio. The method comprises receiving an incoming packet at one of the plurality of unidirectional radios, determining if there is an active link between each of the plurality of unidirectional radios and an unidirectional radio of a neighbor vehicle, relaying the incoming packet to the plurality of unidirectional radios having an active link and transmitting the incoming packet as an outgoing packet from at least one of the plurality of unidirectional radios. If more than one packet is received, the packets can be encoded using group coding before send the packets out as an outgoing packet.

Adaptive In-Network Processing for Bandwidth and Energy Constrained Mission-Oriented Multihop Wireless Networks

Abstract: In-network Processing, involving operations such as filtering, compression, and fusion is a technique widely used in wireless sensor and ad hoc networks for reducing the communication overhead. In many tactical stream-oriented applications, especially in military scenarios, both link bandwidth and node energy are critically constrained resources. For such applications, in-network processing itself imposes nonnegligible computing cost. In this work, we have developed a unified, utility-based closed-loop control framework that permits distributed convergence to both 1) the optimal level of compression performed by a forwarding node on streams, and 2) the best set of nodes where the operators of the stream processing graph should be deployed. We also show how the generalized model can be adapted to more realistic cases, where the in-network operator may be varied only in discrete steps, and where a fusion operation cannot be fractionally distributed across multiple nodes. Finally, we provide a real-time implementation of the protocol on an 802.11b network with a video application and show that the performance of the network is improved significantly in terms of the packet loss, node lifetime, and quality of video received.

On quantification of anchor placement

Abstract: This paper attempts to answer a question: for a given traversal area, how to quantify the geometric impact of anchor placement on localization performance. We present a theoretical framework for quantifying the anchor placement impact. An experimental study, as well as the field test using a UWB ranging technology, is presented. These experimental results validate the theoretical analysis. As a byproduct, we propose a two-phase localization method (TPLM) and show that TPLM outperforms the least-square method in localization accuracy by a huge margin. TPLM performs much faster than the gradient descent method and slightly better than the gradient descent method in localization accuracy. Our field test suggests that TPLM is more robust against noise than the least-square and gradient descent methods.

Method and system supporting mobile coalitions

Abstract: A system and method for supporting mobile coalitions for entertainment comprises devices including a master device, a server having a multimedia service executable by the master device and modules operable to recommend formation of a coalition based on the service, invite the devices to participate in the coalition, set up the coalition by determining the devices to participate, launching on each device a link to the coalition, performing emulation of the coalition by streaming a portion of the service to each device until experience is satisfactory, and continuing by transmitting the service to the devices, capture interactions on the devices by users, the interactions comprising at least gestures, taps correlating to messages of quality of experience, adapt the coalition by managing user inputs conveying quality of experience, maintaining synchronization of the devices, and maintaining the service when one or more of the devices cease to participate, and terminate the coalition.

Network restoration under dual failures using path-protecting preconfigured cycles

Abstract: This paper presents a design algorithm for networks with a restoration mechanism that provides end-to-end path protection to a set of demands with specified working routes, where demands must survive one or two failures in optical networks and these failures may occur almost instantaneously. Each of the demands protected from two failures is assigned two restoration routes and restoration wavelengths on a cycle. A demand protected from a single failure is assigned one restoration route and restoration wavelengths on a cycle. These assignments are preconfigured so that switching and wavelength conversions are not needed at intermediate nodes of restoration routes. Splitting of demand across multiple restoration routes upon a failure occurrence is not allowed. The algorithm generates a large number of candidate Path-Protecting Preconfigured Cycles (PP-PCs). A candidate cycle may provide protection to a mix of demands requiring different protection levels, where demands may share under certain conditions restoration wavelengths even if they are exposed to common failure scenarios and have overlapping restoration routes. A near-optimal set of preconfigured cycles is selected from among all candidates, attempting to minimize the total cost of restoration wavelengths while ensuring that each demand is assigned to a single preconfigured cycle. This is achieved by solving a set covering problem followed by deleting duplicate demand assignments and by resolving wavelength assignment conflicts.

O-PMIPv6: Efficient Handover with route optimization in Proxy Mobile IPv6 domain

Abstract: Proxy Mobile IPv6 (PMIPv6) has been developed by the IETF as a network-based mobility management protocol to support the mobility of IP devices. Although several proposals have been made for localized routing optimization, they don't take into account handover management and localized routing simultaneously. In fact, the localized routing state is only restored after the handover, leading to packet loss and signaling overhead. On the other hand, Fast Handovers for PMIPv6 (F-PMIPv6) protocol has been designed to mainly solve the issues of long handover delay and packets loss during handover. As a result, this paper looks at enhancing F-PMIPv6 by combining the handover with route optimization by proposing a new protocol called Optimized Proxy Mobile IPv6 (O-PMIPv6). The proposed protocol enhances the performance of PMIPv6 and F-PMIPv6 in terms of route optimization handover delay, signaling cost, and network utilization.

Next generation service overlay networks (NGSON) [Guest editorial]

Abstract: This feature topic presents a set of articles discussing various aspects of next-generation service overlay networks as well as the status of standardization effort in this area. Next generation service overlay network (NGSON) is the official name for the related standardization effort under IEEE Project 1903.

Loosely coupled service composition for deployment of next generation service overlay networks

Abstract: In order to provide various attractive services to users, a user-centric approach such as usergenerated contents and services and a platform which can create a service easily and efficiently have been studied and designed during the past two decades. The IEEE NGSON standard has defined a functional architecture that provides advanced overlay functions for value-added services by collaboration of services with features of context awareness, dynamic adaptation and self-organizing management. Its service composition mechanism is comparable with service oriented architecture. However, due to SOA's complexity, it has not become as popular for user-generated services and contents as so-called mashup technologies, which also provide attractive and simple service creation. In this article we propose the adoption of loosely coupled service composition into the NGSON framework that can easily integrate existing communications and data services with little to no dependence on the underlying implementation and service description language details. Furthermore, the NGSON prototype supporting our proposal is presented as a proof of concept and to verify its advantages for operators, service providers, and end users.

Tuning of reinforcement learning parameters applied to OLSR using a cognitive network design tool

Abstract: In wireless mesh networks, with the standard Optimized Link State Routing (OLSR) metric (i.e. hop count), traffic is routed on the shortest path without considering factors such as traffic distribution and link capacities. Consequently, some nodes may get overloaded from the uneven utilization of network resources. OLSR can be modified to use other link cost metrics, with route selection based on lowest cost path. With delay as the metric, OLSR reduces average round trip time but the load-aware routes may cause wide variance in delay and packet reordering due to route oscillations. We describe a new hybrid routing approach that combines the strength of a) link state routing (e.g. fast convergence), b) load-aware routing (e.g., avoiding congested paths) and c) cognitive routing (e.g. learning to avoid path oscillations). In particular, we investigate the use of Q-learning with OLSR to increase network capacity and reduce congestion delay. We present simulation results for a 36 node dynamic mobile ad hoc network, with standard OLSR, a non-cognitive load-aware OLSR (OLSR-D) and our new hybrid cognitive load-aware OLSR (OLSR-Q). We show that OLSR-Q > OLSR-D > OLSR in terms of reducing delay and increasing network capacity. Furthermore, we show that, unlike conventional cognitive Q-routing protocols, our hybrid approach does not reduce performance at low load. Although OLSR-Q can significantly reduce delay and improve capacity, the learning time can reduce connectivity and the distribution of more link state information can reduce raw link capacity. We show how adding OLSR, OLSR-D and OLSR-Q as routing options into the Cognitive Network Engineering Design Analytic Toolset (C-NEDAT), we can select the best routing protocol and parameters (e.g., learning rate) for a given network and its mission. We verify simulation performance improvements by implementing the OLSR-Q in on a 9 node wireless testbed.

Systems and methods for efficient radio frequency spectrum management in a scenario involving multiple mobile vehicles

Abstract: Various embodiments of the present invention relate to wireless network management. One specific example relates to efficient radio frequency (RF) spectrum management involving multiple mobile vehicles, whereby a system and/or a method of the invention achieves greatly improved spectral efficiency in the assignment of frequency bands to communications channels between the vehicles and/or stationary ground stations. Other examples of the present invention provide systems and methods to analyze the RF emissions resulting from the motion of transmitters and/or receivers through airspace with the help of five-dimensional quanta of space (x, y, z), time and frequency to assign frequency bands to test plans (including previously- validated test plan(s) and/or to-be-validated test plan(s)). In one specific example, the analysis is directed to the assignment of frequency bands with and without reuse.

A Multi-Classification Approach for the Detection and Identification of eHealth Applications

Abstract: eHealth services category has a diversified set of traffic patterns and demands in terms of QoS assurances. Existing QoS solutions were designed to support only aggregated classes of service and cannot differentiate traffic based on an application's behavioral pattern. In order to improve the performance of eHealth applications for home and mobile users there is a need to develop new traffic identification techniques, which would work at the edge of the network. This paper addresses the above problem by proposing machine learning-based approach for eHealth traffic identification. We investigate different techniques which combine the results from multiple machine learning classifiers and show which combination of techniques is best suited for identifying diverse eHealth traffic. Our approach is validated in a mobile e-health application context and the results prove that multi-classification techniques can be used in practice to provide application-based service differentiation.

A comparative analysis of predictive and reactive mode of optimized PMIPv6

Abstract: Proxy Mobile IPv6 (PMIPv6) has been developed by the IETF as a network-based mobility management protocol to support the mobility of IP devices. F-PMIPv6 and Localized Routing have been proposed to solve the issues of packet loss/handover delay and non-optimal routing of data packets respectively. Optimized PMIPv6 (O-PMIPv6), as proposed in [1], looked at combining all these features in one solution and was initially designed to work in predictive mode. However, when the mobile node moves very fast, the attachment with the target network may happen before the completion of the tunnel setup procedure between the previous and the new access network while using predictive mode. Moreover, the prediction of the attachment could fail for several reasons such as the lost of the detachment notification messages. All of these scenarios require support of reactive mode for O-PMIPv6. As a result, this paper extends the operation of O-PMIPv6 to the reactive mode. A comparative analysis is done with PMIPv6 and the reactive mode of F-PMIPv6 to study the effectiveness of the proposed extension in terms of route optimization handover delay, signaling cost and network utilization. Finally, the reactive O-PMIPv6 is compared to the predictive O-PMIPv6 to show differences in performance for both approaches.

Seamless data offload and flow mobility in vehicular communications networks

Abstract: With the increasing demand for quality of service (QoS) by end-users, mobility management, IP flow mobility and data offload are key features needed in next-generation wireless networks. With the wide deployment of WiFi (e.g., home, vehicle, smartphones, laptops) and onboard unit (OBU) in automotive and public transportation systems (PTS), it is important to provide mechanisms that allows data offload and seamless handover of sessions between cellular-based vehicular networks (3G/4G) and WiFi as well as IP flow mobility for users in automotive and PTS. Such mechanisms will allow a better resource usage for network operators and guarantee higher QoS for users while considering value-added services in vehicular communication networks (VCNs). Although, several approaches have been proposed for mobility management such as Mobile IP (MIPv4 and MIPv6) and Network Mobility (NEMO), seamless mobility and efficient flow mobility are not guaranteed. This paper proposes a new mechanism for selective IP traffic offload (SIPTO) for VCNs. The proposed solution has been prototyped and the performance evaluation shows improvement in terms of throughput, energy consumption, and flow mobility latency when compared to existing mobility management approaches.

Signaling protocol for multi-domain optical networks

Abstract: A three-way handshake method for optical messaging in a multi-domain optical network that includes a first pass from a source domain to a destination domain through intermediate domains on candidate working paths, collecting information identifying available routing resources for each working path, calculating a working path metric and storing each of the metrics at the respective border node, determining a path key of the topology of each domain working path and using the path key to identify the path outside its domain and determining the best working paths and border nodes to use. A second pass using the path keys for identifying the working path in each domain and reserving the identified routing resources and selecting which routing resources to use. A third pass identifying the selected routing resources and establishing an optical signaling message path between the source node and the destination node.

Special Section on Telematics Advances for Vehicular Communication Networks

Abstract: The ten papers in this special section focus on the hottest issues of vehicular communication networks and telematics applications.

Method, system, user equipment and program for dynamically selecting proxies for communication with servers using known paths

Abstract: Method, User equipment, system and program for limiting an amount of information transmitted between a plurality of user equipments and a server. The method comprising establishing communication links between a plurality of user equipments based upon a proximity of the plurality of user equipments, determining a tactical common mission group selected from the linked plurality of user equipments using a mission profile stored in each of the plurality of user equipments; and selecting a proxy for the tactical common mission group. The proxy communicates with a server on behalf of the tactical common mission group. A proxy is selected based upon a ranking.

Communication Node Operable to Estimate Faults in an Ad Hoc Network and Method of Performing the Same

Abstract: A communication node operable to estimate faults in a mobile ad hoc network and method of performing the same. In one embodiment, the communication node includes a processor and memory including computer program code configured to, with the processor, cause the communication node to monitor a set of observable parameters at the communication node, produce a fault estimate at the communication node from the set of observable parameters, and provide the fault estimate to a global fault detector at another communication node.

Self-organizing distributed service overlay for wireless ad hoc networks

Abstract: An apparatus and a method are operable to enable peer-to-peer communication between a first communication node having a first server application and an associated first client application and a second communication node having a second server application and an associated second client application in a wireless ad hoc network. In one embodiment, the apparatus includes memory including computer program code configured to, with a processor, cause the apparatus to determine an identity and service capability of the second communication node, initiate the first client application on the first communication node, enable the first server application with the first client application on the first communication node to communicate with the second client application via the second server application on the second communication node, and provide a service associated with the first client application and the second client application between the first server application and the second server application.

Differential eye diagrams

Abstract: Changes in a signal are detected. The signal is repeatedly sampled in a synchronous manner during a predetermined interval to generate a captured eye diagram. At least one of a positive differential eye diagram or a negative differential eye diagram is generated from the captured eye diagram and a baseline eye diagram. The at least one positive or negative differential eye diagram is analyzed to determine whether a change in signal conditions is present.