Zobrazeno 1 - 10
of 136
pro vyhledávání: '"Shinoda, Shoji"'
Autor:
Shinoda, Shoji1, Sengoku, Masakazu2
Publikováno v:
Electronics & Communications in Japan, Part 1: Communications. May87, Vol. 70 Issue 5, p1-15. 15p.
Autor:
Sengoku, Masakazu1, Shinoda, Shoji2
Publikováno v:
Electronics & Communications in Japan, Part 1: Communications. Nov86, Vol. 69 Issue 11, p45-54. 10p.
Publikováno v:
IEICE transactions on communications. (5):1095-1103
Recently, the mulitihop wireless network system attracts the interest of many people as a communication network system of the next generation. The multihop wireless network has unique features in which neither base stations nor wired backbone network
Autor:
KANEKO, Yoshihiro, SHINODA, Shoji
Publikováno v:
IEICE transactions on fundamentals of electronics, communications and computer sciences. 85(12):2913-2922
Publikováno v:
IEICE transactions on fundamentals of electronics, communications and computer sciences. (7):1436-1444
Wireless network systems introducing both of the cellular concept and the ad-hoc concept have been proposed. Communication between two nodes in a cell is guaranteed by relaying capability of the base station in these systems. Additionally, two nodes
Autor:
KANEKO, Yoshihiro, SHINODA, Shoji
Publikováno v:
IEICE transactions on fundamentals of electronics, communications and computer sciences. 83(7):1411-1419
Publikováno v:
IEICE transactions on fundamentals of electronics, communications and computer sciences. (6):1222-1227
In a multihop network, radio packets are often relayed through inter-mediate stations (repeaters) in order to transfer a radio packet from a source to its destination. We consider a scheduling problem in a multihop network using a graphtheoretical mo
Autor:
KANEKO, Yoshihiro, SHINODA, Shoji
Publikováno v:
IEICE transactions on fundamentals of electronics, communications and computer sciences. 82(2):394-397
Publikováno v:
IEICE transactions on fundamentals of electronics, communications and computer sciences. (3):470-475
The lower-bounded p-collection problem is the problem where to locate p sinks in a flow network with lower bounds such that the value of a maximum flow is maximum. This paper discusses the cover problems corresponding to the lower bounded p-collectio
Publikováno v:
IEICE transactions on fundamentals of electronics, communications and computer sciences. (3):544-550
Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. Many studies for the theory have been done. We have studied location theory from the standpoint of measuring the closeness