scispace - formally typeset
Search or ask a question

Showing papers by "Venugopal Vasudevan published in 2008"


Patent
10 Jun 2008
TL;DR: In this paper, a method, apparatus, and electronic device for enhancing virtual features in devices are disclosed, and a connection interface may pair the mobile telecommunications apparatus with a first accessory.
Abstract: A method, apparatus, and electronic device for enhancing virtual features in devices are disclosed. A connection interface may pair the mobile telecommunications apparatus with a first accessory. A processor may execute a software program and add a virtual feature associated with the first accessory when the first accessory is present.

16 citations


Patent
16 Dec 2008
TL;DR: In this paper, a network element receives information regarding content clips as pertain to audio-visual content and uses that information to automatically infer a relative popularity of audiovisual content as corresponds to the content clips to provide popularity information.
Abstract: A network element (200) receives (101), from a plurality of different end users (205), information regarding content clips as pertain to audio-visual content and uses (102) that information to automatically infer a relative popularity of audio-visual content as corresponds to the content clips to provide popularity information. Such audio-visual content can comprise, for example, televised content. The aforementioned information can comprise, for example, such items as a start time and a stop time for a given one of the content clips, at least a portion of a given one of the content clips, a content identifier of some kind, and so forth.

12 citations


Patent
15 Dec 2008
TL;DR: In this paper, a group decision-making process is described, where one user (the "control") is selected to propose a possibility (e.g., a group seating arrangement) to other members of the group.
Abstract: Disclosed is a group decision-making process. One user (the “control”) is selected to propose a possibility (e.g., a group seating arrangement) to other members of the group. The other members access on-line information to review the proposal and then send their feedback to the control. The proposal is altered as necessary based on the feedback and on any exigencies (e.g., one of the seats in the proposal becomes unavailable to the group). When consensus is reached within the group, the control launches an interaction with the vendor to implement the consensus decision. In this way, every group member has the opportunity to affect the decision based on whatever information, constraints, or preferences seem relevant to that group member. Also, the proposal is always kept up-to-date so that the final decision is not based on “stale” information.

6 citations


Proceedings ArticleDOI
27 Jan 2008
TL;DR: In this article, the authors proposed distributed algorithms for energy efficient dissemination of presence and content usage information between nodes in mobile ad-hoc networks, where the phase-locked wake-up cycles are exploited to adaptively transition the network interface to a deep sleep state for energy savings.
Abstract: Next generation mobile ad-hoc applications will revolve around users' need for sharing content/presence information with co-located devices. However, keeping such information fresh requires frequent meta-data exchanges, which could result in significant energy overheads. To address this issue, we propose distributed algorithms for energy efficient dissemination of presence and content usage information between nodes in mobile ad-hoc networks. First, we introduce a content dissemination protocol (called CPMP) for effectively distributing frequent small meta-data updates between co-located devices using multicast. We then develop two distributed algorithms that use the CPMP protocol to achieve "phase locked" wake up cycles for all the participating nodes in the network. The first algorithm is designed for fully-connected networks and then extended in the second to handle hidden terminals. The "phase locked" schedules are then exploited to adaptively transition the network interface to a deep sleep state for energy savings. We have implemented a prototype system (called "Where-Fi") on several Motorola Linux-based cell phone models. Our experimental results show that for all network topologies our algorithms were able to achieve "phase locking" between nodes even in the presence of hidden terminals. Moreover, we achieved battery lifetime extensions of as much as 28% for fully connected networks and about 20% for partially connected networks.© (2008) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

3 citations


Patent
21 Jan 2008
TL;DR: In this article, a method and architecture for managing a communication campaign direct toward a plurality of media consumption devices associated with a common user is presented, which includes obtaining communication addresses for each of the plurality of devices (110, 116, 122) associated with the common user.
Abstract: A method and architecture for managing a communication campaign direct toward a plurality of media consumption devices associated with a common user (101), including obtaining communication addresses for each of the plurality of media consumption devices (110, 116, 122) associated with the common user, associating the common user with a communication campaign, and prompting transmission of communications to the common user via the plurality of media consumption devices based on a campaign policy.

1 citations


Proceedings ArticleDOI
08 Dec 2008
TL;DR: An algorithm for synchronizing nodes that periodically broadcast content and presence updates to co-located nodes over an ad-hoc network, where nodes may exhibit Byzantine malicious behavior and a rating based algorithm is devised that rates neighbors based on the consistency of their behaviors.
Abstract: In this paper, we present techniques for synchronizing nodes that periodically broadcast content and presence updates to co-located nodes over an ad-hoc network, where nodes may exhibit Byzantine malicious behavior. We first propose an algorithm for synchronizing the periodic transmissions of all the nodes in an attacker-free multi-hop network. This allows nodes to save battery power by switching off their network cards without missing updates from their neighbors. We then introduce a suite of spoofing attacks and show that they are able to disrupt synchronization and destabilize the network even when launched by a single attacker in large, multi-hop networks. Finally, we devise a rating based algorithm that rates neighbors based on the consistency of their behaviors. By favoring well-behaved nodes in the synchronization process, we show that we can address the issue of Byzantine malicious behavior very effectively. Our evaluation shows that the algorithms are computationally efficient and, for the setup considered, extend the device lifetime by 30% over an always-on Wi-Fi scenario. Moreover, in the presence of attacks, our rating based algorithm quickly stabilizes the synchronization process and reduces the number of lost updates by 85%.

1 citations


Patent
11 Dec 2008
TL;DR: In this article, a method for sharing at least one annotation between a first user and a second user in a communication network is provided, which includes inputting (404) the annotation on the first user media terminal.
Abstract: A method for sharing at least one annotation between a first user media terminal (102) and a second user media terminal (104) in a communication network (100) is provided. The method includes inputting (404) the at least one annotation on the first user media terminal. Further, the method includes anchoring (406) the at least one annotation to the media stream executed on the first user media terminal at a first start time. The at least one annotation is sent (408) to the second user media terminal. The at least one annotation is received (410) at the second user media terminal. Furthermore, the at least one annotation is synchronized (412) at the second user media terminal based on a relative start time. The at least one synchronized annotation is then rendered (414) to the media stream on the second user media terminal.