Institution
Motorola Solutions
Company•Seoul, South Korea•
About: Motorola Solutions is a company organization based out in Seoul, South Korea. It is known for research contribution in the topics: Signal & Communications system. The organization has 2162 authors who have published 2299 publications receiving 25450 citations. The organization is also known as: Motorola Solutions, Inc. & Motorola.
Papers published on a yearly basis
Papers
More filters
•
19 Apr 2005TL;DR: In order to establish routing to/from a base station within a hybrid-cellular network, each network element is assigned a "class" based on a received signal strength of the base station as discussed by the authors.
Abstract: In order to establish routing to/from a base station within a hybrid-cellular network, each network element is assigned a 'class' (2) based on a received signal strength of the base station Each network element is allowed to choose a network element of lower class for relaying information to the base station (3)
20 citations
•
21 Apr 2010TL;DR: In this paper, the identity of a rest channel is transmitted when transmitting during an active communication call on a channel other than the rest channel, and a subscriber unit communicating within the active communication, receives the identity, leaves the active communications, and initiates a new communication on the other channel.
Abstract: Within a two way radio frequency communication system, a repeater transmits an identity of a rest channel when transmitting during an active communication call on a channel other than the rest channel. A subscriber unit communicating within the active communication, receives the identity of the rest channel, leaves the active communication; and initiates a new communication on the rest channel.
20 citations
••
TL;DR: This work proposes a centralized algorithm to flexibly assign spectrum channel or spatial DoF exploiting the multiuser diversity, channel diversity and spatial diversity for a higher performance in a practical network and demonstrates that the algorithm is very effective and can significantly increase the network throughput while reducing the delay.
Abstract: Two fast growing technologies, MIMO and cognitive radio (CR), can both effectively combat the transmission Interference to increase the network throughput. MIMO exploits spatial degree of freedom (DoF) through spatial multiplexing and interference cancelation within the same frequency channel, while CR exploits all available frequency channels for transmissions. We consider an ad hoc network where each node is equipped with an array of cognitive radios. A radio can tune to a different channel and transmit independently, or form MIMO array and transmit together with other radios on the same channel using MIMO. Additionally, different frequency and spatial channels could have different conditions. It is beneficial and also highly challenging for nodes to distributively coordinate in selecting a transmission channel and/or a spatial DoF taking advantage of this unprecedented flexibility and diversity of channels for a higher network performance. In this work, we mathematically model the opportunities and constraints for such a network with the objective of maximizing the weighted network throughput. We propose a centralized algorithm as our comparison benchmark, and a distributed algorithm to flexibly assign spectrum channel or spatial DoF exploiting the multiuser diversity, channel diversity and spatial diversity for a higher performance in a practical network.
20 citations
•
29 Dec 2009TL;DR: In this paper, a shared wireless network QoS manager determines a total capacity of each cell that is needed to satisfy a total resource need on a cell by cell basis for the local QoS managers.
Abstract: Resource allocation is performed in a shared wireless network that includes multiple cells, a shared wireless network QoS manager, and multiple local QoS managers. The shared wireless QoS manager receives from multiple ones of the local QoS managers on a per cell and per QoS service class basis (for a plurality of QoS service classes): an aggregation of current cell usage estimations; an aggregation of cell load level indicators, and an aggregation of additional resources needed. Using this received information, the shared wireless network QoS manager: determines a total capacity of each cell that is needed to satisfy a total resource need on a cell by cell basis for the local QoS managers; and based on a maximum capacity for each cell, allocates to each local QoS manager a percentage of their total resource need.
20 citations
•
24 Sep 2009TL;DR: In this paper, a method and system for transferring an ongoing communication session from one application server (AS) to another is described, where multiple ASs are monitored and serviced by a Transfer Management Module (TMM).
Abstract: A method and system for transferring an ongoing communication session from one application server (AS) to another is described. Multiple ASs are monitored and serviced by a Transfer Management Module (TMM). Each of the ASs serves a different network and each network includes various end devices. During an ongoing communication session, whether the session is to continue using the current AS is determined based on a set of rules. If the session is to be transferred, an alternative AS that provides the same application as the current AS is selected using a set of conditions. Upon selection of the alternative AS, the current AS transfers the control and/or media state of the ongoing session for one to all users through the TMM to the selected AS, and the session is continued.
20 citations
Authors
Showing all 2162 results
Name | H-index | Papers | Citations |
---|---|---|---|
Nitin H. Vaidya | 72 | 420 | 28645 |
Franky So | 69 | 377 | 16864 |
Frederick W. Vook | 42 | 142 | 5445 |
Amitava Ghosh | 35 | 103 | 5760 |
Jeffrey D. Bonta | 34 | 95 | 3164 |
Jheroen P. Dorenbosch | 33 | 115 | 3750 |
Song Q. Shi | 33 | 109 | 4347 |
John M. Harris | 32 | 242 | 3721 |
Miklos Stern | 29 | 85 | 2404 |
Pallab Midya | 27 | 75 | 3216 |
Avinash Joshi | 27 | 58 | 1862 |
Timothy J. Wilson | 25 | 52 | 1671 |
Yadunandana N. Rao | 25 | 83 | 1814 |
Patrick L. Rakers | 25 | 54 | 1760 |
Kenneth A. Dean | 24 | 87 | 3312 |