default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTetsuo Ideguchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j12]Takumi Sanada, Xuejun Tian, Takashi Okuda, Tetsuo Ideguchi:
Estimating the Number of Nodes in WLANs to Improve Throughput and QoS. IEICE Trans. Inf. Syst. 99-D(1): 10-20 (2016)- [j11]Takumi Sanada, Xuejun Tian, Qian Zhao, Takashi Okuda, Tetsuo Ideguchi:
Dynamically Estimating the Number of WLAN to Improve the Throughput and Fairness. J. Inf. Process. 24(1): 64-71 (2016) - 2013
- [j10]Xuejun Tian, Dejian Ye, Tetsuo Ideguchi, Takashi Okuda:
A Proposal of Quasi-Distributed WLAN MAC Protocol with High Throughput and Traffic Adaptability. Inf. Media Technol. 8(2): 546-555 (2013) - [j9]Xuejun Tian, Dejian Ye, Tetsuo Ideguchi, Takashi Okuda:
A Proposal of Quasi-Distributed WLAN MAC Protocol with High Throughput and Traffic Adaptability. J. Inf. Process. 21(2): 206-215 (2013) - [c13]Takashi Doi, Takashi Okuda, Tetsuo Ideguchi, Xuejun Tian:
Performance evaluation of academic-document writing process using software reliability models. ITHET 2013: 1-4 - [c12]Xuejun Tian, Takumi Sanada, Takashi Okuda, Tetsuo Ideguchi:
A novel MAC protocol of wireless LAN with high throughput and fairness. LCN 2013: 671-674 - 2011
- [c11]Taichi Kusaka, Takashi Okuda, Tetsuo Ideguchi, Xuejun Tian:
Queuing theoretic approach to server allocation problem in time-delay cloud computing systems. ITC 2011: 310-311
2000 – 2009
- 2009
- [c10]Takashi Okuda, Takahisa Ichikawa, Tetsuo Ideguchi, Xuejun Tian:
A design method of local community network service systems with ad-hoc network technology. VTC Fall 2009 - 2008
- [j8]Xuejun Tian, Xiang Chen, Tetsuo Ideguchi, Takashi Okuda:
Improving protocol capacity by scheduling random access on WLANs. Telecommun. Syst. 37(1-3): 19-28 (2008) - 2006
- [j7]Shoichiro Seno, Teruko Fujii, Motofumi Tanabe, Eiichi Horiuchi, Yoshimasa Baba, Tetsuo Ideguchi:
Optical Path Protection with Fast Extra Path Preemption. IEICE Trans. Commun. 89-B(11): 3032-3039 (2006) - [j6]Xuejun Tian, Yuguang Fang, Tetsuo Ideguchi:
MATS: multichannel time-spread scheduling in mobile ad hoc networks. IEEE Trans. Wirel. Commun. 5(3): 612-621 (2006) - 2005
- [j5]Xuejun Tian, Xiang Chen, Tetsuo Ideguchi, Yuguang Fang
:
Improving Throughput and Fairness in WLANs through Dynamically Optimizing Backoff. IEICE Trans. Commun. 88-B(11): 4328-4338 (2005) - [c9]Masayuki Tauchi, Tetsuo Ideguchi, Takashi Okuda:
Ad-Hoc Routing Protocol Avoiding Route Breaks Based on AODV. HICSS 2005 - [c8]Shoichiro Seno, Teruko Fujii, Motofumi Tanabe, Eiichi Horiuchi, Yoshimasa Baba, Tetsuo Ideguchi:
A Proposal and Evaluation of Multi-class Optical Path Protection Scheme for Reliable Computing. HPCC 2005: 723-732 - 2004
- [j4]Xuejun Tian, Tetsuo Ideguchi, Takashi Okuda:
Improving Reservation Protocol for Ad Hoc Networks Using Two-Division MAC Backoff Algorithm. IEICE Trans. Inf. Syst. 87-D(2): 436-443 (2004) - [c7]Yosuke Nakamura, Xuejun Tian, Tetsuo Ideguchi, Takashi Okuda:
Access Control Method with Variable Retransmission Probability in Ad-Hoc networks and Its consideration of the Changing Point. DEXA Workshops 2004: 331-336 - [c6]Yosuke Nakamura, Xuejun Tian, Tetsuo Ideguchi, Takashi Okuda:
Access control method with variable retransmission probability in ad-hoc networks. ICME 2004: 2095-2098 - [c5]Xuejun Tian, Yuguang Fang, Tetsuo Ideguchi:
Multichannel time-spread scheduling: a new approach to handling heavy traffic loads in ad hoc networks. WCNC 2004: 1075-1080 - 2003
- [j3]Akira Watanabe, Tetsuo Ideguchi, Iwao Sasase:
Proposal of Dynamic Process Resolution Protocol making transparency of physical locations in closed communication group for intranet. Syst. Comput. Jpn. 34(1): 29-44 (2003) - 2002
- [c4]Takashi Okuda, Yohei Ando, Tetsuo Ideguchi, Xuejun Tian:
A simplified performance evaluation for delay of voice end-user in TDMA integrated voice/data cellular mobile communications systems. GLOBECOM 2002: 891-895 - 2000
- [c3]Akira Watanabe, Toru Inada, Tetsuo Ideguchi, Iwao Sasase:
Proposal of Group Search Protocol Making Secure Communication Groups for Intranet. ICC (2) 2000: 877-881 - [c2]Takashi Okuda, Seiji Adachi, Tetsuo Ideguchi, Hiroshi Yasukawa, Xuejun Tian:
A Dynamic Flexible Grouping over COBRA-based Network and its Application to Mobile Computing. SAC (2) 2000: 692-696
1990 – 1999
- 1999
- [j2]Hiroshi Mineno, Susumu Ishihara, Ken Ohta, Masahiro Aono, Tetsuo Ideguchi, Tadanori Mizuno:
Multiple paths protocol for a cluster type network. Int. J. Commun. Syst. 12(5-6): 391-403 (1999) - [c1]Hiroshi Mineno, L. Junshu, Ken Ohta, Masahiro Aono, Tetsuo Ideguchi, Tadanori Mizuno:
Multiple paths protocol for a cluster type network. IPCCC 1999: 150-156
1980 – 1989
- 1981
- [j1]Tetsuo Ideguchi, Tadanori Mizuno, Hiroshi Matsunaga:
Automatic implementation of communication protocols. Comput. Commun. Rev. 11(1): 40-56 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 00:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
