A proposal of a minimal-state processing search algorithm for link scheduling problems in packet radio networks

Proceedings - 2003 Symposium on Applications and the Internet, SAINT 2003

Volumn , Issue , 2003, Pages 128-135

  Tajima, S ^a   Funabiki, N ^b   Sugano, A ^b   Higashino, T ^a  

^a OSAKA UNIVERSITY   (Japan)

^b OKAYAMA UNIVERSITY   (Japan)

Author keywords

Approximation algorithms; Communication networks; Joining processes; Large scale systems; Packet radio networks; Processor scheduling; Proposals; Radio control; Scheduling algorithm; Usability

Indexed keywords

ALGORITHMS; BENCHMARKING; CHEMICAL ACTIVATION; EVOLUTIONARY ALGORITHMS; INTERNET; ITERATIVE METHODS; LARGE SCALE SYSTEMS; LEARNING ALGORITHMS; PACKET NETWORKS; RADIO; SCHEDULING; SCHEDULING ALGORITHMS; TELECOMMUNICATION NETWORKS;

JOINING PROCESS; PACKET RADIO NETWORKS; PROCESSOR SCHEDULING; PROPOSALS; RADIO CONTROL; USABILITY;

APPROXIMATION ALGORITHMS;

EID: 33645825415     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SAINT.2003.1183041     Document Type: Conference Paper

References (13)

1. J. E. Wieselthier, C. M. Barnhart, and A. Ephremides, "A neural network approach to routing without interference in multihop radio networks," IEEE Trans. Commun., vol. 42, no. 1, pp. 166-177, Jan. 1994.
2. R. G. Ogier and D. A. Beyer, "Neural network solution to the link scheduling problem using convex relaxation,"Proc. IEEE GLOBECOM '90, pp. 1371-1376, Dec. 1990.
3. C. M. Barnhart, J. E. Wieselthier, and A. Ephremides, "A neural network approach to solving the link activation problem in multihop radio networks," IEEE Trans. Commun., vol. 43, no. 2, pp. 1277-1283, Feb. 1995.
4. N. Funabiki and S. Nishikawa, "A binary neural network approach for link activation problems in multihop radio networks," IEICE Trans. Commun., vol.E79-B, no. 8, pp. 1086-1093, Aug. 1996.
5. A. A. Bertossi and M. A. Bonuccelli, "Code assignment for hidden terminal interference avoidance in multihop packet radio networks," IEEE Trans. Networking, vol. 3, no. 4, pp. 441-449, Aug. 1995.
6. N. Funabiki and J. Kitamichi, "A gradual neural-network algorithm for jointly time-slot/code assignment problems in packet radio networks," IEEE Trans. Neural Networks, vol. 9, no. 6, pp. 1523-1528, Nov. 1998.
7. T. Baba, N. Funabiki, S. Nishikawa, and H. Yoshio, "A maximum neural network algorithm for route selection problems in multihop radio networks," Trans. IEE Japan, vol.117-C, no. 7, pp. 874-880, Jul. 1997.
8. T. Baba, N. Funabiki, and S. Nishikawa, "A proposal of a greedy neural network for route assignments in multihop radio networks," IEICE Trans., vol.J81-D-I, no. 6, pp. 700-707, Jun. 1998.
9. T. Baba, N. Funabiki, and S. Tajima "A neural-network combined two-stage algorithm for route assignment problems with reliability satisfaction in multihop radio networks," IEICE Trans., vol. J83-A, no. 1, pp. 47-56, Jan. 2000.
10. B. Hajek and G. Sasaki, "Link scheduling in polynomial time," IEEE Trans. Inform. Theory, vol. 34, no. 5, pp. 910-917, Sep. 1988.
11. U. Mukherji, "A periodic scheduling problem in flow control for data communication networks," IEEE Trans. Inform. Theory, vol. 35, no. 2, pp. 436-443, Mar. 1989.
12. N. Funabiki and T. Higashino, "A minimal-state processing search algorithm for graph coloring problems,"IEICE Trans. Fundamentals, vol.E83-A, no. 7, pp. 1420-1430, Jul. 2000.
13. D. S. Johnson, "Approximation algorithms for combinatorial problems," J. Comput. Syst. Sci., vol. 9, pp. 256-278, 1974.