International Conference on Computer Communications and Networks 

About: International Conference on Computer Communications and Networks is an academic conference. The conference publishes majorly in the area(s): Network packet & Quality of service. Over the lifetime, 3547 publications have been published by the conference receiving 49916 citations.

Behavior recognition via sparse spatio-temporal features

Abstract: A common trend in object recognition is to detect and leverage the use of sparse, informative feature points. The use of such features makes the problem more manageable while providing increased robustness to noise and pose variation. In this work we develop an extension of these ideas to the spatio-temporal case. For this purpose, we show that the direct 3D counterparts to commonly used 2D interest point detectors are inadequate, and we propose an alternative. Anchoring off of these interest points, we devise a recognition algorithm based on spatio-temporally windowed data. We present recognition results on a variety of datasets including both human and rodent behavior.

On-demand multipath routing for mobile ad hoc networks

Abstract: Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently attracted attention because of their low routing overhead. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Such floods take up a substantial portion of network bandwidth. We focus on a particular on-demand protocol, called dynamic source routing, and show how intelligent use of multipath techniques can reduce the frequency of query floods. We develop an analytic modeling framework to determine the relative frequency of query floods for various techniques. Results show that while multipath routing is significantly better than single path routing, the performance advantage is small beyond a few paths and for long path lengths. It also shows that providing all intermediate nodes in the primary (shortest) route with alternative paths has a significantly better performance than providing only the source with alternate paths.

QoS-based Discovery and Ranking of Web Services

Abstract: Discovering Web services using keyword-based search techniques offered by existing UDDI APIs (i.e. Inquiry API) may not yield results that are tailored to clients' needs. When discovering Web services, clients look for those that meet their requirements, primarily the overall functionality and quality of service (QoS). Standards such as UDDI, WSDL, and SOAP have the potential of providing QoS-aware discovery, however, there are technical challenges associated with existing standards such as the client's ability to control and manage discovery of Web services across accessible service registries. This paper proposes a solution to this problem and introduces the Web service relevancy function (WsRF) used for measuring the relevancy ranking of a particular Web service based on client's preferences, and QoS metrics. We present experimental validation, results, and analysis of the presented ideas.

A scalable solution to minimum cost forwarding in large sensor networks

Abstract: Wireless sensor networks offer a wide range of challenges to networking research, including unconstrained network scale, limited computing, memory and energy resources, and wireless channel errors. We study the problem of delivering messages from any sensor to an interested client user along the minimum-cost path in a large sensor network. We propose a new cost field based approach to minimum cost forwarding. In the design, we present a novel backoff-based cost field setup algorithm that finds the optimal costs of all nodes to the sink with one single message overhead at each node. Once the field is established, the message, carrying dynamic cost information, flows along the minimum cost path in the cost field. Each intermediate node forwards the message only if it finds itself to be on the optimal path, based on dynamic cost states. Our design does not require an intermediate node to maintain explicit "forwarding path" states. It requires a few simple operations and scales to any network size. We show the correctness and effectiveness of the design by both simulations and analysis.

A multichannel CSMA MAC protocol with receiver-based channel selection for multihop wireless networks

Abstract: We propose a CSMA-based medium access control protocol for multihop wireless networks that uses multiple channels and a dynamic channel selection method. The proposed protocol uses one control channel and N data channels, where N is independent of the number of nodes in the network. The source uses an exchange of control packets on the control channel to decide on the best channel to send the data packet on. Channel selection is based on maximizing the signal-to-interference plus noise ratio at the receiver. We present performance evaluations obtained from simulations that demonstrate the effectiveness of the proposed protocol.