Tatsuro Takahashi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tatsuro Takahashi has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Ryoichi Shinkuma
Shibaura Institute of Technology, Tokyo, Japan
6 shared publications - Francesco De Pellegrini
CREATE-NET, Trento, Italy
1 shared publication Hiroki Nishikawa
1 shared publication- Hiroyuki Kasai
Department of Computer Science and Communication Engineering WASEDA University 3-4-1 Okubo Shinjuku- ku 169-8555 Tokyo Japan
1 shared publication Hiroyuki Yamamoto
Graduate School of Informatics, Kyoto University, Japan, Tel: +81-75-753-4830, Fax +81-75-753-4986
1 shared publication- Hiroyuki Yamamoto
Graduate School of Informatics, Kyoto University, Japan, Tel: +81-75-753-4830, Fax +81-75-753-4986
1 shared publication
Latest Publications
- 29 August 2012
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 17 (6) , 831-840
Trigger Detection Using Geographical Relation Graph for Social Context Awareness
- 29 August 2012
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 17 (6) , 831-840
Trigger Detection Using Geographical Relation Graph for Social Context Awareness
- 1 October 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E91-B (10) , 3132-3140
Incentive-Rewarding Mechanism for User-position Control in Mobile Services
When the number of users in a service area increases in mobile multimedia services, no individual user can obtain satisfactory radio resources such as bandwidth and signal power because the resources are limited and shared. A solution for such a problem is user-position control. In the user-position control, the operator informs users of better communication areas (or spots) and navigates them to these positions. However, because of subjective costs caused by subjects moving from their original to a new position, they do not always attempt to move. To motivate users to contribute their resources in network services that require resource contributions for users, incentive-rewarding mechanisms have been proposed. However, there are no mechanisms that distribute rewards appropriately according to various subjective factors involving users. Furthermore, since the conventional mechanisms limit how rewards are paid, they are applicable only for the network service they targeted. In this paper, we propose a novel incentive-rewarding mechanism to solve these problems, using an external evaluator and interactive learning agents. We also investigated ways of appropriately controlling rewards based on user contributions and system service quality. We applied the proposed mechanism and reward control to the user-position control, and demonstrated its validity.
- 1 October 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E91-B (10) , 3132-3140
Incentive-Rewarding Mechanism for User-position Control in Mobile Services
When the number of users in a service area increases in mobile multimedia services, no individual user can obtain satisfactory radio resources such as bandwidth and signal power because the resources are limited and shared. A solution for such a problem is user-position control. In the user-position control, the operator informs users of better communication areas (or spots) and navigates them to these positions. However, because of subjective costs caused by subjects moving from their original to a new position, they do not always attempt to move. To motivate users to contribute their resources in network services that require resource contributions for users, incentive-rewarding mechanisms have been proposed. However, there are no mechanisms that distribute rewards appropriately according to various subjective factors involving users. Furthermore, since the conventional mechanisms limit how rewards are paid, they are applicable only for the network service they targeted. In this paper, we propose a novel incentive-rewarding mechanism to solve these problems, using an external evaluator and interactive learning agents. We also investigated ways of appropriately controlling rewards based on user contributions and system service quality. We applied the proposed mechanism and reward control to the user-position control, and demonstrated its validity.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21617929,p. 1-3
Improving Fairness of Adaptive Flow Control Protocol for Optical Packet Networks
We proposed a flow control protocol to attain higher throughput in rather high packet loss environment by controlling packet size as well as window size. Since this protocol takes rather aggressive policy, throughput of existing TCP is severely depressed by the coexisting flows with proposed protocol. This paper introduces RTT analysis into flow control protocol to improve fairness.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21617929,p. 1-3
Improving Fairness of Adaptive Flow Control Protocol for Optical Packet Networks
We proposed a flow control protocol to attain higher throughput in rather high packet loss environment by controlling packet size as well as window size. Since this protocol takes rather aggressive policy, throughput of existing TCP is severely depressed by the coexisting flows with proposed protocol. This paper introduces RTT analysis into flow control protocol to improve fairness.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E90-B (2) , 425-428
Channel Quality Improvement by Inter-Vehicle Packet Relay in Road Vehicle Communication Systems
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E90-B (2) , 425-428
Channel Quality Improvement by Inter-Vehicle Packet Relay in Road Vehicle Communication Systems
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21669570,p. 1-5
Reduction of Computation and Control Costs for Opportunistic Scheduling in Slotted DS-CDMA Uplinks
To satisfy the recent increase in demand for uplink data in code division multiple access systems, opportunistic scheduling methods for uplinks have been investigated. In this paper, we discuss an optimum scheduling for voice/data packet systems. When it is implemented in practical systems, limitations such as selectable SF, computation and control costs will reduce the performance. We evaluated three approaches to apply the optimum scheduling to practical systems and compared them to our proposed heuristic scheduling, where minimum computation and control costs are required. The computer simulation results showed that our proposed method is reasonable and the optimum scheduling provides high throughput by expanding the computation and control interval while reducing the costs
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21669570,p. 1-5
Reduction of Computation and Control Costs for Opportunistic Scheduling in Slotted DS-CDMA Uplinks
To satisfy the recent increase in demand for uplink data in code division multiple access systems, opportunistic scheduling methods for uplinks have been investigated. In this paper, we discuss an optimum scheduling for voice/data packet systems. When it is implemented in practical systems, limitations such as selectable SF, computation and control costs will reduce the performance. We evaluated three approaches to apply the optimum scheduling to practical systems and compared them to our proposed heuristic scheduling, where minimum computation and control costs are required. The computer simulation results showed that our proposed method is reasonable and the optimum scheduling provides high throughput by expanding the computation and control interval while reducing the costs
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21669570,p. 1-5
Cooperative Networking in Heterogeneous Infrastructure Multihop Mobile Networks
Cooperation between different mobile networks linked by multiple-interface mobile stations (MMSs) can yield many benefits, including coverage expansion, load balancing, and throughput improvement. We developed a network control mechanism, cooperative networking, which controls the cooperative benefits in heterogeneous infra-multihop networks. The proposed mechanism assigns a cooperation rule to MSs. By following the rule, every MS chooses a path to a base station, such as direct connection to 3G networks or infra-multihop connection to wireless local area networks. Cooperation rules are designed according to the cooperative benefits. In our proposed cooperative networking mechanism, network operators can adaptively select a networking policy appropriate for network conditions and the needs of users. Computer simulation results validated our proposed mechanism
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21669570,p. 1-5
Cooperative Networking in Heterogeneous Infrastructure Multihop Mobile Networks
Cooperation between different mobile networks linked by multiple-interface mobile stations (MMSs) can yield many benefits, including coverage expansion, load balancing, and throughput improvement. We developed a network control mechanism, cooperative networking, which controls the cooperative benefits in heterogeneous infra-multihop networks. The proposed mechanism assigns a cooperation rule to MSs. By following the rule, every MS chooses a path to a base station, such as direct connection to 3G networks or infra-multihop connection to wireless local area networks. Cooperation rules are designed according to the cooperative benefits. In our proposed cooperative networking mechanism, network operators can adaptively select a networking policy appropriate for network conditions and the needs of users. Computer simulation results validated our proposed mechanism
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 331-333
Fairness Evaluation of Adaptive Flow Control Algorithm for Optical Packet Networks
This paper proposes new flow control algorithm to attain higher throughput in rather high packet loss environment. Packet size is also adaptively controlled as well as window size, and a control method to improve fairness is presented.
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 331-333
Fairness Evaluation of Adaptive Flow Control Algorithm for Optical Packet Networks
This paper proposes new flow control algorithm to attain higher throughput in rather high packet loss environment. Packet size is also adaptively controlled as well as window size, and a control method to improve fairness is presented.
- 1 April 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E89-B (4) , 1110-1118
Estimating Method of Short-Interval-Traffic Distribution Considering Long-Term-Traffic Dynamics for Multimedia QoS Management
- 1 April 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E89-B (4) , 1110-1118
Estimating Method of Short-Interval-Traffic Distribution Considering Long-Term-Traffic Dynamics for Multimedia QoS Management
- 1 July 2005
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E88-A (7) , 1800-1808
An Application of Uplink Common Channel to Packet Relay in CDMA Radio Access Networks
- 1 July 2005
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- Vol. E88-A (7) , 1800-1808
An Application of Uplink Common Channel to Packet Relay in CDMA Radio Access Networks